package com.wc.AlgoOJ_homework.AlgoOJ_test6.G_范围更新点查询;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/3/22 20:29
 * @description http://43.138.190.70:8888/p/765?tid=65f90101f9a80dc9ddc3f0c4
 */
public class Main {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 200010;
    static int[] a = new int[N];
    static int[] s = new int[N << 2];
    static int[] lazy = new int[N << 2];
    static int t, n, q, x, op, l, r;

    public static void main(String[] args) {
        t = sc.nextInt();
        while (t-- > 0) {
            n = sc.nextInt();
            q = sc.nextInt();
            for (int i = 1; i <= n; i++) a[i] = sc.nextInt();
            build(1, n, 1);
            while (q-- > 0) {
                op = sc.nextInt();
                if (op == 1) {
                    l = sc.nextInt();
                    r = sc.nextInt();
                    update(1, n, 1, l, r);
                } else {
                    x = sc.nextInt();
                    out.println(query(1, n, 1, x, 0));
                }
            }
            Arrays.fill(lazy, 1, n << 2, 0);
        }
        out.flush();
    }

    static int query(int l, int r, int t, int idx, int laz) {
        if (l == r) {
            laz += lazy[t];
            int pre= s[t];
            while (laz-- > 0) {
                int ss = pre;
                pre = 0;
                while (ss > 0) {
                    pre += ss % 10;
                    ss /= 10;
                }
                if (pre < 10) break;
            }
            return pre;
        }
        int mid = l + r >> 1;
        if (mid >= idx) return query(l, mid, t << 1, idx, laz + lazy[t]);
        return query(mid + 1, r, t << 1 | 1, idx, laz + lazy[t]);
    }

    static void update(int l, int r, int t, int ql, int qr) {
        if (l == ql && r == qr) {
            lazy[t] += 1;
            return;
        }

        int mid = l + r >> 1;
        if (mid >= qr) update(l, mid, t << 1, ql, qr);
        else if (mid + 1 <= ql) update(mid + 1, r, t << 1 | 1, ql, qr);
        else {
            update(l, mid, t << 1, ql, mid);
            update(mid + 1, r, t << 1 | 1, mid + 1, qr);
        }
    }

    static void build(int l, int r, int t) {
        if (l == r) {
            s[t] = a[l];
            return;
        }
        int mid = l + r >> 1;
        build(l, mid, t << 1);
        build(mid + 1, r, t << 1 | 1);
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}